Comments on "Minimum-latency transport protocols with modulo-N incarnation numbers"
نویسندگان
چکیده
منابع مشابه
On Euler Numbers modulo Powers of Two
To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M. A. Stern.
متن کاملEuler Numbers modulo 2
Let {En} be the Euler numbers. In the paper we give a general congruence modulo 2(m+2)n involving for Eb and for E2mk+b, where k, m, n are positive integers and b ∈ {0, 2, 4, . . .}. MSC: Primary 11B68, Secondary 11A07
متن کاملOn the minimum latency problem
We are given a set of points p 1 ;. .. ; p n and a symmetric distance matrix (d ij) giving the distance between p i and p j. We wish to construct a tour that minimizes P n i=1`(i), wherè(i) is the latency of p i , deened to be the distance traveled before rst visiting p i. This problem is also known in the literature as the delivery-man problem or the traveling repairman problem. It arises in a...
متن کاملSome comments on Garsia numbers
AGarsia number is an algebraic integer of norm ±2 such that all of the roots of its minimal polynomial are strictly greater than 1 in absolute value. Little is known about the structure of the set of Garsia numbers. The only known limit point of positive real Garsia numbers was 1 (given, for example, by the set of Garsia numbers 21/n). Despite this, there was no known interval of [1,2] where th...
متن کاملMultiple Product Modulo Arbitrary Numbers
Let n binary numbers of length n be given. The Boolean function ``Multiple Product'' MPn asks for (some binary representation of ) the value of their product. It has been shown (K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems, SIAM J. Discrete Math. 7, 285 292 (1994)) that this function can be computed in polynomial-size threshold circu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 1996
ISSN: 1063-6692,1558-2566
DOI: 10.1109/90.532874